{	Problem: http://codeforces.ru/problemset/problem/99/B
	 Verdict: Accepted
}
uses
        SysUtils, Math;

const
        GOOD='Exemplary pages.';
        BAD='Unrecoverable configuration.';

type
        cup = record
                v,n:longint;
        end;

var
        i,n,s:longint;
        a:array[0..1010] of cup;
        f:boolean;

procedure put(x,y:longint);
begin
write((a[y].v-a[x].v) shr 1,' ml. from cup #',a[x].n,' to cup #',a[y].n,'.');
end;

procedure sort(l,r:longint);

var
        i,j,x:longint;
        y:cup;

begin
i:=l;
j:=r;
x:=a[(l+r) shr 1].v;
repeat
        while a[i].v<x do inc(i);
        while a[j].v>x do dec(j);
        if i<=j then begin
                y:=a[i];
                a[i]:=a[j];
                a[j]:=y;
                inc(i);
                dec(j);
        end;
until i>j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;

begin
read(n);
s:=0;
for i:=1 to n do begin
        read(a[i].v);
        a[i].n:=i;
        inc(s,a[i].v);          
end;
if s mod n <> 0 then begin
        write(BAD);
        halt(0);
end;
sort(1,n);
f:=true;
for i:=2 to n do 
        if a[i].v<>a[i-1].v then begin
                f:=false;
                break;
        end;
if f then begin
        write(GOOD);
        halt(0);
end;
if n=2 then begin
        if odd(a[1].v+a[2].v) then write(BAD) else put(1,2);
end else 
if n=3 then begin
        if (a[1].v=a[2].v) or (a[2].v=a[3].v) or odd(a[1].v+a[3].v) then write(BAD) else put(1,3);
end else begin
        if (a[2].v<>a[n-1].v) or (a[1].v=a[2].v) or (a[n].v=a[n-1].v) or odd(a[1].v+a[n].v) then write(BAD) else put(1,n);      
end;
end.